Relaxation time for a dimer covering with height representation
نویسندگان
چکیده
منابع مشابه
Dimer covering and percolation frustration.
Covering a graph or a lattice with nonoverlapping dimers is a problem that has received considerable interest in areas, such as discrete mathematics, statistical physics, chemistry, and materials science. Yet, the problem of percolation on dimer-covered lattices has received little attention. In particular, percolation on lattices that are fully covered by nonoverlapping dimers has not evidentl...
متن کاملA Robust Optimization Approach for a p-Hub Covering Problem with Production Facilities, Time Horizons and Transporter
Hub location-allocation problems are currently a subject of keen interest in the research community. However, when this issue is considered in practice, significant difficulties such as traffic, commodity transportation and telecommunication tend to be overlooked. In this paper, a novel robust mathematical model for a p-hub covering problem, which tackles the intrinsic uncertainty of some param...
متن کاملRelaxation Heuristics for the Set Covering Problem
The set covering problem (SCP) is one of representative combinatorial optimization problems, which has many practical applications. The continuous development of mathematical programming has derived a number of impressive heuristic algorithms as well as exact branch-and-bound algorithms, which can solve huge SCP instances of bus, railway and airline crew scheduling problems. We survey heuristic...
متن کاملHeight fluctuations in the honeycomb dimer model
We study a model of random surfaces arising in the dimer model on the honeycomb lattice. For a fixed “wire frame” boundary condition, as the lattice spacing ǫ → 0, Cohn, Kenyon and Propp [3] showed the almost sure convergence of a random surface to a non-random limit shape Σ0. In [11], Okounkov and the author showed how to parametrize the limit shapes in terms of analytic functions, in particul...
متن کاملA set-covering formulation for a drayage problem with single and double container loads
This paper addresses a drayage problem, which is motivated by the case study of a real carrier. Its trucks carry one or two containers from a port to importers and from exporters to the port. Since up to four customers can be served in each route, we propose a set-covering formulation for this problem where all possible routes are enumerated. This model can be efficiently solved to optimality b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Physics
سال: 1997
ISSN: 0022-4715,1572-9613
DOI: 10.1007/bf02765532